combinatorial representation

См. также в других словарях:

• Combinatorial map — A combinatorial map is a combinatorial object modelling topological structures with subdivided objects. Historically, the concept was introduced informally by J. Edmonds for polyhedral surfaces [1] which are planar graphs. It was given its first… …   Wikipedia

• Combinatorial number system — In mathematics, and in particular in combinatorics, the combinatorial number system of degree k (for some positive integer k), also referred to as combinadics, is a correspondence between natural numbers (taken to include 0) N and k… …   Wikipedia

• Representation theory — This article is about the theory of representations of algebraic structures by linear transformations and matrices. For the more general notion of representations throughout mathematics, see representation (mathematics). Representation theory is… …   Wikipedia

• Combinatorial principles — In proving results in combinatorics several useful combinatorial rules or combinatorial principles are commonly recognized and used. The rule of sum, rule of product, and inclusion exclusion principle are often used for enumerative purposes.… …   Wikipedia

• List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… …   Wikipedia

• Boundary representation — In solid modeling and computer aided design, boundary representation often abbreviated as B rep or BREP is a method for representing shapes using the limits. A solid is represented as a collection of connected surface elements, the boundary… …   Wikipedia

• Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… …   Wikipedia

• Rotation system — In combinatorial mathematics, rotation systems encode embeddings of graphs onto orientable surfaces, by describing the circular ordering of a graph s edges around each vertex.A more formal definition of a rotation system involves pairs of… …   Wikipedia

• Дилуорса теорема — Теорема Дилуорса в комбинаторике  утверждение, характеризующее экстремальное свойство для частично упорядоченных множеств. Содержание 1 Формулировака 2 Примечания …   Википедия

• Теорема Дилуорса — в комбинаторике  утверждение, характеризующее экстремальное свойство для частично упорядоченных множеств. Содержание 1 Формулировка 2 Примечания 3 …   Википедия

• Graph embedding — In topological graph theory, an embedding of a graph G on a surface Sigma; is a representation of G on Sigma; in which points of Sigma; are associated to vertices and simple arcs (homeomorphic images of [0,1] ) are associated to edges in such a… …   Wikipedia